New voter verification scheme using pre-encrypted ballots

نویسندگان

  • Victor Morales-Rocha
  • Miguel Soriano
  • Jordi Puiggali
چکیده

0140-3664/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.comcom.2009.03.007 * Corresponding author. Tel.: +34 93 4230324; fax: E-mail addresses: [email protected] (V. Morales-Rocha), [email protected] (M. Soria (J. Puiggalí). In order for remote electronic voting systems to be reliable, voter verification is an essential feature. Most pre-encrypted ballot schemes proposed to date allow voters to verify that their votes have been properly recorded in the voting server. Such verification makes it possible to detect manipulation of the vote in the voting terminal or during its transmission. However, these schemes do not allow voters to verify that their votes have been accurately included in the counting process. In this paper, we describe a new proposal that solves this problem. Under the proposed scheme, voters can verify that their votes have been properly recorded, and they also have the opportunity to individually verify that their votes have been properly included in the counting process. Voter verification is thus achieved in two different contexts: proper recording and accurate counting. 2009 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DRE-ip: A Verifiable E-Voting Scheme Without Tallying Authorities

Nearly all verifiable e-voting schemes require trustworthy authorities to perform the tallying operations. An exception is the DRE-i system which removes this requirement by pre-computing all encrypted ballots before the election using random factors that will later cancel out and allow the public to verify the tally after the election. While the removal of tallying authorities significantly si...

متن کامل

A Practical Privacy Preserving E-Voting Protocol Using Dynamic Ballots

We describe a practical e-voting protocol which guarantees e-voting protocol requirements: eligibility, privacy, accuracy, fairness, receipt-freeness, uncoercibility, robustness and verifiability. Unlike existing blind signature based protocols, in which the authority blindly signs ballot or part of ballot, the authority in our protocol blindly signs voter’s pseudo identity. Hereafter, voter be...

متن کامل

Proving Prêt à Voter Receipt Free Using Computational Security Models

Prêt à Voter is a supervised, end-to-end verifiable voting scheme. Informal analyses indicate that, subject to certain assumptions, Prêt à Voter is receipt free, i.e. a voter has no way to construct a proof to a coercer of how she voted. In this paper we propose a variant of Prêt à Voter and prove receipt freeness of this scheme using computational methods. Our proof shows that if there exists ...

متن کامل

The USENIX Journal of Election Technology and Systems

Prêt à Voter is a supervised, end-to-end verifiable voting scheme. Informal analyses indicate that, subject to certain assumptions, Prêt à Voter is receipt free, i.e. a voter has no way to construct a proof to a coercer of how she voted. In this paper we propose a variant of Prêt à Voter and prove receipt freeness of this scheme using computational methods. Our proof shows that if there exists ...

متن کامل

Scantegrity III: Automatic Trustworthy Receipts, Highlighting Over/Under Votes, and Full Voter Verifiability

Building on lessons learned from the November 2009 Scantegrity II election in Takoma Park, MD, we propose improvements to the Scantegrity II voting system that (1) automatically print trustworthy receipts for easier on-line verification, (2) highlight ballot features including over/under votes to comply with the Help America Vote Act, and (3) achieve full voter verifiability by eliminating prin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Communications

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2009